Optimality in noisy importance sampling

نویسندگان

چکیده

Many applications in signal processing and machine learning require the study of probability density functions (pdfs) that can only be accessed through noisy evaluations. In this work, we analyze importance sampling (IS), i.e., IS working with evaluations target density. We present general framework derive optimal proposal densities for estimators. The proposals incorporate information variance realizations, proposing points regions where noise power is higher. also compare use previous optimality approaches considered a framework.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Optimality of Correlated Sampling

In the correlated sampling problem, two players, say Alice and Bob, are given two distributions, say P and Q respectively, over the same universe and access to shared randomness. The two players are required to output two elements, without any interaction, sampled according to their respective distributions, while trying to minimize the probability that their outputs disagree. A well-known prot...

متن کامل

Importance Sampling

We describe an application of using a change of sampling density to get easier access to rare events during numeric simulations (this is called importance sampling). Our emphasis is on the derivation of the change of density instead of the algorithmic details. We work a small example to make the technique concrete.

متن کامل

Asymptotic Optimality in Sampling-based Motion Planning

Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particular, the piano movers’ problem [1], [2] is known to be PSPACE-hard, which implies that any algorithm aimed to solve this problem (with completeness guarantees) is expected not to scale well with increasing number of dimensions of the configuration sp...

متن کامل

Adaptive Sampling for Noisy Problems

The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the sample average as an estimate of the true objective value. The number of samples is typically chosen arbitrarily and remains constant for the entire optimization process. This paper studies an adaptive sampling technique that varie...

متن کامل

Advances in Lifted Importance Sampling

We consider lifted importance sampling (LIS), a previously proposed approximate inference algorithm for statistical relational learning (SRL) models. LIS achieves substantial variance reduction over conventional importance sampling by using various lifting rules that take advantage of the symmetry in the relational representation. However, it suffers from two drawbacks. First, it does not take ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing

سال: 2022

ISSN: ['0165-1684', '1872-7557']

DOI: https://doi.org/10.1016/j.sigpro.2022.108455